Sequential BKW-Operators and Function Algebras

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toeplitz Operators and Related Function Algebras on Certain Pseudoconvex Domains

Toeplitz operators are defined on pseudoconvex domains in C and their spectral properties are studied. In addition, the linear space HTM + C is discussed and is seen to be a closed algebra on a variety of domains.

متن کامل

Information Algebras and Consequence Operators

We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...

متن کامل

Differential operators and Cherednik algebras

We establish a link between two geometric approaches to the representation theory of rational Cherednik algebras of type A: one based on a noncommutative Proj construction [GS1]; the other involving quantum hamiltonian reduction of an algebra of differential operators [GG]. In this paper, we combine these two points of view by showing that the process of hamiltonian reduction intertwines a natu...

متن کامل

Nonrepresentable Sequential Algebras

The sequential calculus of von Karger and Hoare [18] is designed for reasoning about sequential phenomena, dynamic or temporal logic, and concurrent or reactive systems. Unlike the classical calculus of relations, it has no operation for forming the converse of a relation. Sequential algebras [15] are algebras that satisfy certain equations in the sequential calculus. One standard example of a ...

متن کامل

Sequential Automatic Algebras

A sequential automatic algebra is a structure of the type (A; f1, . . . , fn), where A is recognised by a finite automaton, and functions f1, . . . , fn are total operations on A that are computed by inputoutput automata. Our input-output automata are variations of Mealy automata. We study some of the fundamental properties of these algebras and provide many examples. We give classification res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1996

ISSN: 0021-9045

DOI: 10.1006/jath.1996.0036